Morphological Agreement in Minimalist Grammars
نویسنده
چکیده
Minimalist Grammars provide a useful tool for modeling natural language syntax by defining grammar fragments in a very precise way. As a formalization of the Minimalist Program, they can accommodate linguistic analyses from the field of generative syntax. However, they have no machinery for encoding agreement; while morphology can be simulated by multiplying lexical items, there is no systematic way to state generalizations and implement actual proposals. This paper extends Minimalist Grammars with morphological features and operations on them. As a proof of concept, I show how Icelandic dative intervention can be encoded in the modified formalism.
منابع مشابه
Semantic Aspects of Minimalist Grammars
Minimalist grammars are a rich lexicalized syntactic formalism which inherits the depth and wide covering of the generative tradition. Nevertheless up to now there is no straightforward way to extract the predicative structure of a sentence from syntactic analyses and from the predicative structure of the lexical items. In this paper we try to apply to this richer syntactic model the traditiona...
متن کاملDependency Structures Derived from Minimalist Grammars
This paper provides an interpretation of Minimalist Grammars [16,17] in terms of dependency structures. Under this interpretation, merge operations derive projective dependency structures, and movement operations introduce both non-projectivity and illnestedness. This new characterization of the generative capacity of Minimalist Grammar makes it possible to discuss the linguistic relevance of n...
متن کاملTree Adjunction as Minimalist Lowering
Even though Minimalist grammars are more powerful than TAG on the string level, the classes of tree languages the two define are incomparable. I give a constructive proof that if the standard Move operation in Minimalist grammars is replaced by Reset Lowering, every TAG tree language can be generated. The opposite does not hold, so the strong generative capacity of Minimalist grammars with Rese...
متن کاملA probabilistic top-down parser for minimalist grammars
This paper describes a probabilistic top-down parser for minimalist grammars. Top-down parsers have the great advantage of having a certain predictive power during the parsing, which takes place in a left-to-right reading of the sentence. Such parsers have already been well-implemented and studied in the case of Context-Free Grammars (see for example [Roa01]), which are already top-down, but th...
متن کاملParsing Minimalist Languages with Interpreted Regular Tree Grammars
Minimalist Grammars (MGs) (Stabler, 1997) are a formalisation of Chomsky’s minimalist program (Chomsky, 1995), which currently dominates much of mainstream syntax. MGs are simple and intuitive to work with, and are mildly context sensitive (Michaelis, 1998), putting them in the right general class for human language (Joshi, 1985).1 Minimalist Grammars are known to be more succinct than their Mu...
متن کامل